Opacity with powerful attackers

Hardest Attackers

Most interesting properties of computer systems are inherently undecidable yet static analysis allows to automatically validate systems against such properties by making sure to always “err on the safe side”. We take this idea one step further by identifying “hardest attackers” in such a way that if the static analysis is able to demonstrate protection against the “hardest attacker” then the sy...

Games with Opacity Condition

We describe the class of games with opacity condition, as an adequate model for security aspects of computing systems. We study their theoretical properties, relate them to reachability perfect information games and exploit this relation to discuss a search approach with heuristics, based on the directing-word problem in automata theory.

Defending against Roadside Attackers

Communication between vehicles is a very promising technology to reduce fatalities and injuries in road traffic. Vehicles spontaneously form communication networks where they exchange messages to warn surrounding vehicles. Theoretically, this system is open to any communication node that is equipped with the required communication technology. This openness demands appropriate security mechanism...

Different attackers navigate differently

A Network Game with Attackers and a Defender: A Survey

We survey a research line recently initiated by Mavronicolas et al. [14, 15, 16], concerning a strategic game on a graph G(V,E) with two confronting classes of randomized players: ν attackers who choose vertices and wish to minimize the probability of being caught by the defender, who chooses edges and gains the expected number of attackers it catches. So, the defender captures system rationali...